TSTP Solution File: ITP213^1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : ITP213^1 : TPTP v8.2.0. Released v8.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n027.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon May 20 22:16:56 EDT 2024

% Result   : Theorem 18.10s 5.68s
% Output   : CNFRefutation 18.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   29
% Syntax   : Number of formulae    :   51 (  27 unt;  20 typ;   0 def)
%            Number of atoms       :   42 (  21 equ;   0 cnn)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :  229 (  11   ~;   8   |;   0   &; 207   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   4 avg)
%            Number of types       :    6 (   5 usr)
%            Number of type conns  :   14 (  14   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   17 (  15 usr;   9 con; 0-3 aty)
%            Number of variables   :   42 (  18   ^  24   !;   0   ?;  42   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    produc3658429121746597890et_nat: $tType ).

thf(decl_sort2,type,
    assn: $tType ).

thf(decl_sort3,type,
    set_nat: $tType ).

thf(decl_sort4,type,
    heap_e7401611519738050253t_unit: $tType ).

thf(decl_sort5,type,
    a: $tType ).

thf(decl_27,type,
    rep_assn: assn > produc3658429121746597890et_nat > $o ).

thf(decl_293,type,
    times_times_assn: assn > assn > assn ).

thf(decl_453,type,
    hoare_new_addrs: heap_e7401611519738050253t_unit > set_nat > heap_e7401611519738050253t_unit > set_nat ).

thf(decl_520,type,
    inf_inf_set_nat: set_nat > set_nat > set_nat ).

thf(decl_575,type,
    sup_sup_set_nat: set_nat > set_nat > set_nat ).

thf(decl_851,type,
    bot_bot_set_nat: set_nat ).

thf(decl_996,type,
    produc7507926704131184380et_nat: heap_e7401611519738050253t_unit > set_nat > produc3658429121746597890et_nat ).

thf(decl_1332,type,
    q: a > assn ).

thf(decl_1333,type,
    r: assn ).

thf(decl_1334,type,
    as1: set_nat ).

thf(decl_1335,type,
    as2: set_nat ).

thf(decl_1336,type,
    as: set_nat ).

thf(decl_1338,type,
    h: heap_e7401611519738050253t_unit ).

thf(decl_1339,type,
    h2: heap_e7401611519738050253t_unit ).

thf(decl_1340,type,
    r2: a ).

thf(fact_458_sup__commute,axiom,
    ( sup_sup_set_nat
    = ( ^ [X909: set_nat,X787: set_nat] : ( sup_sup_set_nat @ X787 @ X909 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_458_sup__commute) ).

thf(fact_405_inf__commute,axiom,
    ( inf_inf_set_nat
    = ( ^ [X786: set_nat,X787: set_nat] : ( inf_inf_set_nat @ X787 @ X786 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_405_inf__commute) ).

thf(fact_90_assn__times__comm,axiom,
    ( times_times_assn
    = ( ^ [X221: assn,X222: assn] : ( times_times_assn @ X222 @ X221 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_90_assn__times__comm) ).

thf(conj_0,conjecture,
    rep_assn @ ( times_times_assn @ ( q @ r2 ) @ r ) @ ( produc7507926704131184380et_nat @ h @ ( hoare_new_addrs @ h2 @ as @ h ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

thf(fact_36_star__assnI,axiom,
    ! [X7: assn,X1: heap_e7401611519738050253t_unit,X2: set_nat,X8: assn,X56: set_nat] :
      ( ( rep_assn @ X7 @ ( produc7507926704131184380et_nat @ X1 @ X2 ) )
     => ( ( rep_assn @ X8 @ ( produc7507926704131184380et_nat @ X1 @ X56 ) )
       => ( ( ( inf_inf_set_nat @ X2 @ X56 )
            = bot_bot_set_nat )
         => ( rep_assn @ ( times_times_assn @ X7 @ X8 ) @ ( produc7507926704131184380et_nat @ X1 @ ( sup_sup_set_nat @ X2 @ X56 ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_36_star__assnI) ).

thf(fact_4__092_060open_062new__addrs_Ah_Aas_Ah_H_A_061_Anew__addrs_Ah_Aas1_Ah_H_A_092_060union_062_Aas2_092_060close_062,axiom,
    ( ( hoare_new_addrs @ h2 @ as @ h )
    = ( sup_sup_set_nat @ ( hoare_new_addrs @ h2 @ as1 @ h ) @ as2 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_4__092_060open_062new__addrs_Ah_Aas_Ah_H_A_061_Anew__addrs_Ah_Aas1_Ah_H_A_092_060union_062_Aas2_092_060close_062) ).

thf(fact_3_DJN,axiom,
    ( ( inf_inf_set_nat @ ( hoare_new_addrs @ h2 @ as1 @ h ) @ as2 )
    = bot_bot_set_nat ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3_DJN) ).

thf(fact_7_MDL,axiom,
    rep_assn @ ( q @ r2 ) @ ( produc7507926704131184380et_nat @ h @ ( hoare_new_addrs @ h2 @ as1 @ h ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_7_MDL) ).

thf(fact_1__092_060open_062_Ih_H_M_Aas2_J_A_092_060Turnstile_062_AR_092_060close_062,axiom,
    rep_assn @ r @ ( produc7507926704131184380et_nat @ h @ as2 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1__092_060open_062_Ih_H_M_Aas2_J_A_092_060Turnstile_062_AR_092_060close_062) ).

thf(c_0_9,plain,
    ( sup_sup_set_nat
    = ( ^ [Z0: set_nat,Z1: set_nat] : ( sup_sup_set_nat @ Z1 @ Z0 ) ) ),
    inference(fof_simplification,[status(thm)],[fact_458_sup__commute]) ).

thf(c_0_10,plain,
    ( inf_inf_set_nat
    = ( ^ [Z0: set_nat,Z1: set_nat] : ( inf_inf_set_nat @ Z1 @ Z0 ) ) ),
    inference(fof_simplification,[status(thm)],[fact_405_inf__commute]) ).

thf(c_0_11,plain,
    ( times_times_assn
    = ( ^ [Z0: assn,Z1: assn] : ( times_times_assn @ Z1 @ Z0 ) ) ),
    inference(fof_simplification,[status(thm)],[fact_90_assn__times__comm]) ).

thf(c_0_12,plain,
    ( sup_sup_set_nat
    = ( ^ [Z0: set_nat,Z1: set_nat] : ( sup_sup_set_nat @ Z1 @ Z0 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_13,plain,
    ( inf_inf_set_nat
    = ( ^ [Z0: set_nat,Z1: set_nat] : ( inf_inf_set_nat @ Z1 @ Z0 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

thf(c_0_14,negated_conjecture,
    ~ ( rep_assn @ ( times_times_assn @ ( q @ r2 ) @ r ) @ ( produc7507926704131184380et_nat @ h @ ( hoare_new_addrs @ h2 @ as @ h ) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).

thf(c_0_15,plain,
    ( times_times_assn
    = ( ^ [Z0: assn,Z1: assn] : ( times_times_assn @ Z1 @ Z0 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

thf(c_0_16,plain,
    ! [X28301: assn,X28302: heap_e7401611519738050253t_unit,X28303: set_nat,X28304: assn,X28305: set_nat] :
      ( ~ ( rep_assn @ X28301 @ ( produc7507926704131184380et_nat @ X28302 @ X28303 ) )
      | ~ ( rep_assn @ X28304 @ ( produc7507926704131184380et_nat @ X28302 @ X28305 ) )
      | ( ( inf_inf_set_nat @ X28303 @ X28305 )
       != bot_bot_set_nat )
      | ( rep_assn @ ( times_times_assn @ X28301 @ X28304 ) @ ( produc7507926704131184380et_nat @ X28302 @ ( sup_sup_set_nat @ X28303 @ X28305 ) ) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_36_star__assnI])]) ).

thf(c_0_17,plain,
    ( ( hoare_new_addrs @ h2 @ as @ h )
    = ( sup_sup_set_nat @ ( hoare_new_addrs @ h2 @ as1 @ h ) @ as2 ) ),
    inference(split_conjunct,[status(thm)],[fact_4__092_060open_062new__addrs_Ah_Aas_Ah_H_A_061_Anew__addrs_Ah_Aas1_Ah_H_A_092_060union_062_Aas2_092_060close_062]) ).

thf(c_0_18,plain,
    ! [X3: set_nat,X2: set_nat] :
      ( ( sup_sup_set_nat @ X2 @ X3 )
      = ( sup_sup_set_nat @ X3 @ X2 ) ),
    inference(arg_cong,[status(thm)],[c_0_12]) ).

thf(c_0_19,plain,
    ( ( inf_inf_set_nat @ ( hoare_new_addrs @ h2 @ as1 @ h ) @ as2 )
    = bot_bot_set_nat ),
    inference(split_conjunct,[status(thm)],[fact_3_DJN]) ).

thf(c_0_20,plain,
    ! [X3: set_nat,X2: set_nat] :
      ( ( inf_inf_set_nat @ X2 @ X3 )
      = ( inf_inf_set_nat @ X3 @ X2 ) ),
    inference(arg_cong,[status(thm)],[c_0_13]) ).

thf(c_0_21,negated_conjecture,
    ~ ( rep_assn @ ( times_times_assn @ ( q @ r2 ) @ r ) @ ( produc7507926704131184380et_nat @ h @ ( hoare_new_addrs @ h2 @ as @ h ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

thf(c_0_22,plain,
    ! [X6: assn,X5: assn] :
      ( ( times_times_assn @ X5 @ X6 )
      = ( times_times_assn @ X6 @ X5 ) ),
    inference(arg_cong,[status(thm)],[c_0_15]) ).

thf(c_0_23,plain,
    ! [X1: heap_e7401611519738050253t_unit,X2: set_nat,X5: assn,X6: assn,X3: set_nat] :
      ( ( rep_assn @ ( times_times_assn @ X5 @ X6 ) @ ( produc7507926704131184380et_nat @ X1 @ ( sup_sup_set_nat @ X2 @ X3 ) ) )
      | ~ ( rep_assn @ X5 @ ( produc7507926704131184380et_nat @ X1 @ X2 ) )
      | ~ ( rep_assn @ X6 @ ( produc7507926704131184380et_nat @ X1 @ X3 ) )
      | ( ( inf_inf_set_nat @ X2 @ X3 )
       != bot_bot_set_nat ) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

thf(c_0_24,plain,
    ( ( sup_sup_set_nat @ as2 @ ( hoare_new_addrs @ h2 @ as1 @ h ) )
    = ( hoare_new_addrs @ h2 @ as @ h ) ),
    inference(rw,[status(thm)],[c_0_17,c_0_18]) ).

thf(c_0_25,plain,
    ( ( inf_inf_set_nat @ as2 @ ( hoare_new_addrs @ h2 @ as1 @ h ) )
    = bot_bot_set_nat ),
    inference(rw,[status(thm)],[c_0_19,c_0_20]) ).

thf(c_0_26,negated_conjecture,
    ~ ( rep_assn @ ( times_times_assn @ r @ ( q @ r2 ) ) @ ( produc7507926704131184380et_nat @ h @ ( hoare_new_addrs @ h2 @ as @ h ) ) ),
    inference(rw,[status(thm)],[c_0_21,c_0_22]) ).

thf(c_0_27,plain,
    ! [X6: assn,X5: assn,X1: heap_e7401611519738050253t_unit] :
      ( ( rep_assn @ ( times_times_assn @ X5 @ X6 ) @ ( produc7507926704131184380et_nat @ X1 @ ( hoare_new_addrs @ h2 @ as @ h ) ) )
      | ~ ( rep_assn @ X6 @ ( produc7507926704131184380et_nat @ X1 @ ( hoare_new_addrs @ h2 @ as1 @ h ) ) )
      | ~ ( rep_assn @ X5 @ ( produc7507926704131184380et_nat @ X1 @ as2 ) ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).

thf(c_0_28,plain,
    rep_assn @ ( q @ r2 ) @ ( produc7507926704131184380et_nat @ h @ ( hoare_new_addrs @ h2 @ as1 @ h ) ),
    inference(split_conjunct,[status(thm)],[fact_7_MDL]) ).

thf(c_0_29,plain,
    rep_assn @ r @ ( produc7507926704131184380et_nat @ h @ as2 ),
    inference(split_conjunct,[status(thm)],[fact_1__092_060open_062_Ih_H_M_Aas2_J_A_092_060Turnstile_062_AR_092_060close_062]) ).

thf(c_0_30,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : ITP213^1 : TPTP v8.2.0. Released v8.1.0.
% 0.06/0.13  % Command    : run_E %s %d THM
% 0.14/0.34  % Computer : n027.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Sat May 18 17:21:38 EDT 2024
% 0.14/0.34  % CPUTime    : 
% 0.20/0.47  Running higher-order theorem proving
% 0.20/0.47  Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 18.10/5.68  # Version: 3.1.0-ho
% 18.10/5.68  # partial match(2): HMLMSMSMSSLCHFA
% 18.10/5.68  # Preprocessing class: HMLLSMLMSSLCHFA.
% 18.10/5.68  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.10/5.68  # Starting new_ho_10 with 1500s (5) cores
% 18.10/5.68  # Starting sh5l with 300s (1) cores
% 18.10/5.68  # Starting new_bool_1 with 300s (1) cores
% 18.10/5.68  # Starting new_bool_2 with 300s (1) cores
% 18.10/5.68  # new_bool_2 with pid 27557 completed with status 0
% 18.10/5.68  # Result found by new_bool_2
% 18.10/5.68  # partial match(2): HMLMSMSMSSLCHFA
% 18.10/5.68  # Preprocessing class: HMLLSMLMSSLCHFA.
% 18.10/5.68  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.10/5.68  # Starting new_ho_10 with 1500s (5) cores
% 18.10/5.68  # Starting sh5l with 300s (1) cores
% 18.10/5.68  # Starting new_bool_1 with 300s (1) cores
% 18.10/5.68  # Starting new_bool_2 with 300s (1) cores
% 18.10/5.68  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 18.10/5.68  # Search class: HGHSM-SMLM32-DHFFFSBN
% 18.10/5.68  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 18.10/5.68  # Starting new_ho_10 with 181s (1) cores
% 18.10/5.68  # new_ho_10 with pid 27558 completed with status 0
% 18.10/5.68  # Result found by new_ho_10
% 18.10/5.68  # partial match(2): HMLMSMSMSSLCHFA
% 18.10/5.68  # Preprocessing class: HMLLSMLMSSLCHFA.
% 18.10/5.68  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.10/5.68  # Starting new_ho_10 with 1500s (5) cores
% 18.10/5.68  # Starting sh5l with 300s (1) cores
% 18.10/5.68  # Starting new_bool_1 with 300s (1) cores
% 18.10/5.68  # Starting new_bool_2 with 300s (1) cores
% 18.10/5.68  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 18.10/5.68  # Search class: HGHSM-SMLM32-DHFFFSBN
% 18.10/5.68  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 18.10/5.68  # Starting new_ho_10 with 181s (1) cores
% 18.10/5.68  # Preprocessing time       : 0.078 s
% 18.10/5.68  # Presaturation interreduction done
% 18.10/5.68  
% 18.10/5.68  # Proof found!
% 18.10/5.68  # SZS status Theorem
% 18.10/5.68  # SZS output start CNFRefutation
% See solution above
% 18.10/5.68  # Parsed axioms                        : 11206
% 18.10/5.68  # Removed by relevancy pruning/SinE    : 9631
% 18.10/5.68  # Initial clauses                      : 2890
% 18.10/5.68  # Removed in clause preprocessing      : 112
% 18.10/5.68  # Initial clauses in saturation        : 2778
% 18.10/5.68  # Processed clauses                    : 12055
% 18.10/5.68  # ...of these trivial                  : 482
% 18.10/5.68  # ...subsumed                          : 5192
% 18.10/5.68  # ...remaining for further processing  : 6381
% 18.10/5.68  # Other redundant clauses eliminated   : 977
% 18.10/5.68  # Clauses deleted for lack of memory   : 0
% 18.10/5.68  # Backward-subsumed                    : 109
% 18.10/5.68  # Backward-rewritten                   : 92
% 18.10/5.68  # Generated clauses                    : 137652
% 18.10/5.68  # ...of the previous two non-redundant : 124885
% 18.10/5.68  # ...aggressively subsumed             : 0
% 18.10/5.68  # Contextual simplify-reflections      : 33
% 18.10/5.68  # Paramodulations                      : 136184
% 18.10/5.68  # Factorizations                       : 22
% 18.10/5.68  # NegExts                              : 1
% 18.10/5.68  # Equation resolutions                 : 1006
% 18.10/5.68  # Disequality decompositions           : 0
% 18.10/5.68  # Total rewrite steps                  : 25001
% 18.10/5.68  # ...of those cached                   : 21750
% 18.10/5.68  # Propositional unsat checks           : 0
% 18.10/5.68  #    Propositional check models        : 0
% 18.10/5.68  #    Propositional check unsatisfiable : 0
% 18.10/5.68  #    Propositional clauses             : 0
% 18.10/5.68  #    Propositional clauses after purity: 0
% 18.10/5.68  #    Propositional unsat core size     : 0
% 18.10/5.68  #    Propositional preprocessing time  : 0.000
% 18.10/5.68  #    Propositional encoding time       : 0.000
% 18.10/5.68  #    Propositional solver time         : 0.000
% 18.10/5.68  #    Success case prop preproc time    : 0.000
% 18.10/5.68  #    Success case prop encoding time   : 0.000
% 18.10/5.68  #    Success case prop solver time     : 0.000
% 18.10/5.68  # Current number of processed clauses  : 4023
% 18.10/5.68  #    Positive orientable unit clauses  : 551
% 18.10/5.68  #    Positive unorientable unit clauses: 23
% 18.10/5.68  #    Negative unit clauses             : 189
% 18.10/5.68  #    Non-unit-clauses                  : 3260
% 18.10/5.68  # Current number of unprocessed clauses: 116954
% 18.10/5.68  # ...number of literals in the above   : 378015
% 18.10/5.68  # Current number of archived formulas  : 0
% 18.10/5.68  # Current number of archived clauses   : 2126
% 18.10/5.68  # Clause-clause subsumption calls (NU) : 1890993
% 18.10/5.68  # Rec. Clause-clause subsumption calls : 1100421
% 18.10/5.68  # Non-unit clause-clause subsumptions  : 3603
% 18.10/5.68  # Unit Clause-clause subsumption calls : 121618
% 18.10/5.68  # Rewrite failures with RHS unbound    : 0
% 18.10/5.68  # BW rewrite match attempts            : 1306
% 18.10/5.68  # BW rewrite match successes           : 470
% 18.10/5.68  # Condensation attempts                : 12056
% 18.10/5.68  # Condensation successes               : 110
% 18.10/5.68  # Termbank termtop insertions          : 2298146
% 18.10/5.68  # Search garbage collected termcells   : 146370
% 18.10/5.68  
% 18.10/5.68  # -------------------------------------------------
% 18.10/5.68  # User time                : 4.061 s
% 18.10/5.68  # System time              : 0.137 s
% 18.10/5.68  # Total time               : 4.198 s
% 18.10/5.68  # Maximum resident set size: 39204 pages
% 18.10/5.68  
% 18.10/5.68  # -------------------------------------------------
% 18.10/5.68  # User time                : 4.984 s
% 18.10/5.68  # System time              : 0.165 s
% 18.10/5.68  # Total time               : 5.149 s
% 18.10/5.68  # Maximum resident set size: 29312 pages
% 18.10/5.68  % E---3.1 exiting
% 18.10/5.68  % E exiting
%------------------------------------------------------------------------------